Effect of pressure gradients on the different stages of roughness induced boundary layer transition

The physical mechanisms of roughness-induced transition (RIT) in pressure gradient boundary layers are studied using direct numerical simulations. Recent investigations have examined RIT processes in zero-pressure-gradient boundary layers (Suryanarayanan et al., 2019). The present study uses a vorticity dynamics point of view to examine how these processes are altered by a locally accelerating or decelerating flow that strains the vorticity field and creates a net vorticity flux at the wall. Flow acceleration is imposed on specific streamwise extents of the flow. This provides an understanding about how the fundamental mechanisms in different stages of RIT are affected by pressure gradients. The present results suggest that both lift-up and subsequent amplification of the unsteady perturbations are mitigated by flow acceleration. The effect on lift-up is explained by the compression (i.e. large negative value of the stretching term) of the wall-normal vorticity by negative dv/dy. Consistent with earlier experimental observations on spots and wedges, favorable pressure gradients reduce turbulent wedge spreading and nearly arrest the spreading when sufficiently strong. This result is also explained in terms of vorticity dynamics.     

A periodic isoperimetric problem related to the unique games conjecture

We prove the endpoint case of a conjecture of Khot and Moshkovitz related to the unique games conjecture, less a small error. Let n ≥ 2. Suppose a subset Ω of n‐dimensional Euclidean space satisfies ?Ω = Ω^c and Ω + v = Ω^c (up to measure zero sets) for every standard basis vector . For any and for any q ≥ 1, let and let . For any x ∈ ?Ω, let N(x) denote the exterior normal vector at x such that ‖N(x)‖₂ = 1. Let . Our main result shows that B has the smallest Gaussian surface area among all such subsets Ω, less a small error: In particular, Standard arguments extend these results to a corresponding weak inequality for noise stability. Removing the factor 6 × 10^?9 would prove the endpoint case of the Khot‐Moshkovitz conjecture. Lastly, we prove a Euclidean analogue of the Khot and Moshkovitz conjecture. The full conjecture of Khot and Moshkovitz provides strong evidence for the truth of the unique games conjecture, a central conjecture in theoretical computer science that is closely related to the P versus NP problem. So, our results also provide evidence for the truth of the unique games conjecture. Nevertheless, this paper does not prove any case of the unique games conjecture.     

Sliding mode control for a diffuse interface tumor growth model coupling a Cahn–Hilliard equation with a reaction–diffusion equation

We consider the sliding mode control (SMC) problem for a diffuse interface tumor growth model coupling a Cahn–Hilliard equation with a reaction–diffusion equation perturbed by a maximal monotone nonlinearity. We prove existence and regularity of strong solutions and, under further assumptions, a uniqueness result. Then, we show that the chosen SMC law forces the system to reach within finite time a sliding manifold that we chose in order that the tumor phase remains constant in time.     

基于时变Copula模型的 基金收益率相依关系的应用研究

基于时变Copula模型,获得预测方差,确定单个基金收益率序列的边缘分布.利用常见的静态Copula和时变Copula模型对基金收益率序列间两两相依关系进行建模并进行对比分析.应用研究表明,基于MCMC方法的时变Copula模型能更有效地度量基金收益率序列的风险.     

A benchmark of optimally folded protein structures using integer programming and the 3D-HP-SC model

The Protein Structure Prediction (PSP) problem comprises, among other issues, forecasting the three-dimensional native structure of proteins using only their primary structure information. Most computational studies in this area use synthetic data instead of real biological data. However, the closer to the real-world, the more the impact of results and their applicability. This work presents 17 real protein sequences extracted from the Protein Data Bank for a benchmark to the PSP problem using the tri-dimensional Hydrophobic-Polar with Side-Chains model (3D-HP-SC). The native structure of these proteins was found by maximizing the number of hydrophobic contacts between the side-chains of amino acids. The problem was treated as an optimization problem and solved by means of an Integer Programming approach. Although the method optimally solves the problem, the processing time has an exponential trend. Therefore, due to computational limitations, the method is a proof-of-concept and it is not applicable to large sequences. For unknown sequences, an upper bound of the number of hydrophobic contacts (using this model) can be found, due to a linear relationship with the number of hydrophobic residues. The comparison between the predicted and the biological structures showed that the highest similarity between them was found with distance thresholds around 5.2–8.2 Å. Both the dataset and the programs developed will be freely available to foster further research in the area.